Program Logics: theory and applications

نویسنده

  • Nikolay V. Shilov
چکیده

Program logics are modal logics used in software/hardware specii-cation/veriication for sound reasoning about programs. Program logics comprised dynamic logics, temporal logics, logics of process(es), and their extensions by means of xpoints. A more recent addition to the family of program logics are logics of knowledge and belief. The talk introduces (on an informal level) several popular program logics (including Computation Tree Logic and Mu-Calculus), surveys fundamental results and research problems for this logics. Some links to software tools and experimental systems based on program logics are included. Several well-known computer scientists and mathematicians have contributed to this research domain, ex. research are well known around the world. In contrast , research of scientists from former Soviet Union are less known abroad in spite of their importance for progress of program logics. The talk surveys some related results of several researchers: The talk also presents several of forthcoming international conferences related to Theoretical Computer Science, Theory of Computing, and Theory of Computations which are organized under auspice of Rus-sian Academy of Science in Russia in 2001. In spite of the importance of Formal Methods for development of a reliable hardware and software, this domain is not well acquainted to non-professionals. In particular, many hacker programmers suppose that Formal Methods are too pure for their poor mathematics, while many mathematical purists suppose that Formal Methods are too poor for their pure mathematics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Providers and Patients Caught Between Standardization and Individualization: Individualized Standardization as a Solution; Comment on “(Re) Making the Procrustean Bed? Standardization and Customization as Competing Logics in Healthcare”

In their 2017 article, Mannion and Exworthy provide a thoughtful and theory-based analysis of two parallel trends in modern healthcare systems and their competing and conflicting logics: standardization and customization. This commentary further discusses the challenge of treatment decision-making in times of evidence-based medicine (EBM), shared decision-making and personalized medicine. From ...

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Evaluating Automated Theorem Provers for First-Order Modal Logics

First-order modal logics have many applications, e.g., in planning, natural language processing, program verification, querying knowledge bases, and modeling communication. This paper gives an overview of several new implementations of theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus...

متن کامل

Binary Multirelations

Binary multirelations associate elements of a set with its subsets; hence they are binary relations of type A × 2. Applications include alternating automata, models and logics for games, program semantics with dual demonic and angelic nondeterministic choices and concurrent dynamic logics. This proof document supports an arXiv article that formalises the basic algebra of multirelations and prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007